POLYNOMIAL OBSERVABLES IN THE GRAPH PARTITIONING PROBLEM
نویسندگان
چکیده
منابع مشابه
Polynomial Observables in the Graph Partitioning Problem
Although NP-Complete problems are the most difficult decisional problems, it’s possible to discover in them polynomial (or easy) observables. We study the Graph Partitioning Problem showing that it’s possible to recognize in it two correlated polynomial observables. The particular behaviour of one of them with respect to the connectivity of the graph suggests the presence of a phase transition ...
متن کاملSum-Max Graph Partitioning Problem
This paper tackles the following problem: given a connected graph G = (V,E) with a weight function on its edges and an integer k ≤ |V |, find a partition of V into k clusters such that the sum (over all pairs of clusters) of the heaviest edges between the clusters is minimized. We first prove that this problem (and even the unweighted variant) cannot be approximated within a factor of O(n1− ) u...
متن کاملHybrid Metaheuristics for the Graph Partitioning Problem
The Graph Partitioning Problem (GPP) is one of the most studied NPcomplete problems notable for its broad spectrum of applicability such as in VLSI design, data mining, image segmentation, etc. Due to its high computational complexity, a large number of approximate approaches have been reported in the literature. Hybrid algorithms that are based on adaptations of popular metaheuristic technique...
متن کاملA Graph Based Davidson Algorithm for the Graph Partitioning Problem
The problem of partitioning a graph such that the number of edges incident to vertices in diierent partitions is minimized, arises in many contexts. Some examples include its recursive application for minimizing ll-in in matrix factorizations and load-balancing for parallel algorithms. Spectral graph partitioning algorithms partition a graph using the eigenvector associated with the second smal...
متن کاملA Polynomial Algorithm for Balanced Clustering via Graph Partitioning
The objective of clustering is to discover natural groups in datasets and to identify geometrical structures which might reside there, without assuming any prior knowledge on the characteristics of the data. The problem can be seen as detecting the inherent separations between groups of a given point set in a metric space governed by a similarity function. The pairwise similarities between all ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Modern Physics C
سال: 2001
ISSN: 0129-1831,1793-6586
DOI: 10.1142/s0129183101001456